On the enumeration of polynomials with prescribed factorization pattern

نویسندگان

چکیده

We use generating functions over group rings to count polynomials finite fields with the first few coefficients and a factorization pattern prescribed. In particular, we obtain different exact formulas for number of monic n-smooth degree m field, as well prescribed trace coefficient.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some compact generalization of inequalities for polynomials with prescribed zeros

‎Let $p(z)=z^s h(z)$ where $h(z)$ is a polynomial‎ ‎of degree at most $n-s$ having all its zeros in $|z|geq k$ or in $|z|leq k$‎. ‎In this paper we obtain some new results about the dependence of $|p(Rz)|$ on $|p(rz)| $ for $r^2leq rRleq k^2$‎, ‎$k^2 leq rRleq R^2$ and for $Rleq r leq k$‎. ‎Our results refine and generalize certain well-known polynomial inequalities‎.

متن کامل

Fibre products of supersingular curves and the enumeration of irreducible polynomials with prescribed coefficients

For any positive integers n ≥ 3, r ≥ 1 we present formulae for the number of irreducible polynomials of degree n over the finite field F2r where the coefficients of xn−1, xn−2 and xn−3 are zero. Our proofs involve counting the number of points on certain algebraic curves over finite fields, a technique which arose from Fourier-analysing the known formulae for the F2 base field cases, reverse-en...

متن کامل

Counting permutations and polynomials with a restricted factorization pattern

We determine the asymptoti probability that a polynomial of degree n over a nite eld with q elements has no more than k irredu ible fa tors of any degree, for ea h natural number k. In parti ular we show that when q is large, almost 90% of su h polynomials have no more than 2 irredu ible fa tors of any given degree and almost 98% have no more than 3 irredu ible fa tors of any given degree. Simi...

متن کامل

some compact generalization of inequalities for polynomials with prescribed zeros

‎let $p(z)=z^s h(z)$ where $h(z)$ is a polynomial‎ ‎of degree at most $n-s$ having all its zeros in $|z|geq k$ or in $|z|leq k$‎. ‎in this paper we obtain some new results about the dependence of $|p(rz)|$ on $|p(rz)| $ for $r^2leq rrleq k^2$‎, ‎$k^2 leq rrleq r^2$ and for $rleq r leq k$‎. ‎our results refine and generalize certain well-known polynomial inequalities‎.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Finite Fields and Their Applications

سال: 2022

ISSN: ['1090-2465', '1071-5797']

DOI: https://doi.org/10.1016/j.ffa.2022.102030